A Loss Calibarated Methods for Bipartite Rationing Problems
نویسندگان
چکیده
The standard problem of rationing a single overdemanded commodity (O’Neill [1982], Aumann and Maschler [1985], Young [1987]) has a natural bipartite extension with multiple types of a single commodity (e.g., jobs with different skill requirements), and each agent can only consume some types of the resource (e.g., workers have different skills). We define the new standard loss calibrated rationing methods, that equalize across agents the ratio of shares to (calibrated) losses (demand minus share). We extend them to bipartite methods that 1) are not affected by the elimination of an edge and the corresponding flow (Consistency), and 2) treat resource types with identical connectivity as a single type. They are essentially the only standard methods with a bipartite extension meeting the two properties above. Most of the parametric methods discussed in the literature (Young [1987], Young [1988]) do not admit such extension.
منابع مشابه
The Bipartite Rationing Problem
In the bipartite rationing problem, a set of agents share a single resource available in different “types”, each agent has a claim over only a subset of the resource-types, and these claims overlap in arbitrary fashion. The goal is to divide fairly the various types of resource between the claimants, when resources are in short supply. With a single type of resource, this is the standard ration...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملAxiomatic Cost and Surplus-Sharing
The equitable division of a joint cost (or a jointly produced output) among agents with different shares or types of output (or input) commodities, is a central theme of the theory of cooperative games with transferable utility. Ever since Shapley’s seminal contribution in 1953, this question has generated some of the deepest axiomatic results of modern microeconomic theory. More recently, the ...
متن کاملAdministrative rationing and multiple equilibria
In this paper, we introduce non-interest profit/loss sharing (PLS) banks into a three-period overlapping generations model. Two types, (low- and high quality) investments are assumed and capital accumulation and level of output in the steady state is considered. Then, administrative rationing is introduced to the model. It is shown that the level of capital accumulation and output in equilibriu...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013